Enter a number to see how tree shape impacts search performance.
Height is minimal (approx. O(log n))
Height: 3
Steps Taken: 0
Height is maximal (approx. O(n))
Height: 9